Integration over quantum permutation groups
نویسندگان
چکیده
منابع مشابه
Integration over Quantum Permutation Groups
A remarkable fact, discovered by Wang in [14], is that the set Xn = {1, . . . , n} has a quantum permutation group. For n = 1, 2, 3 this is the usual symmetric group Sn. However, starting from n = 4 the situation is different: for instance the dual of Z2 ∗ Z2 acts on X4. In other words, “quantum permutations” do exist. They form a compact quantum group Qn, satisfying the axioms of Woronowicz in...
متن کاملIntegration over Compact Quantum Groups
We find a combinatorial formula for the Haar functional of the orthogonal and unitary quantum groups. As an application, we consider diagonal coefficients of the fundamental representation, and we investigate their spectral measures. Introduction A basic question in functional analysis is to find axioms for quantum groups, which ensure the existence of a Haar measure. In the compact case, this ...
متن کاملAlgebraic Quantum Permutation Groups
We discuss some algebraic aspects of quantum permutation groups, working over arbitrary fields. If K is any characteristic zero field, we show that there exists a universal cosemisimple Hopf algebra coacting on the diagonal algebra K: this is a refinement of Wang’s universality theorem for the (compact) quantum permutation group. We also prove a structural result for Hopf algebras having a non-...
متن کاملPermutation Presentations of Modules over Finite Groups
We introduce a notion of permutation presentations of modules over finite groups, and completely determine finite groups over which every module has a permutation presentation. To get this result, we prove that every coflasque module over a cyclic p-group is permutation projective.
متن کاملPseudorandom Permutation Families over Abelian Groups
We propose a general framework for differential and linear cryptanalysis of block ciphers when the block is not a bitstring. We prove piling-up lemmas for the generalized differential probability and the linear potential, and we study their lower bounds and average value, in particular in the case of permutations of Fp. Using this framework, we describe a toy cipher, that operates on blocks of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2007
ISSN: 0022-1236
DOI: 10.1016/j.jfa.2006.09.005